23 Lecture
CS402
Midterm & Final Term Short Notes
Regular languages
Regular languages are a subset of formal languages, which can be recognized by deterministic or non-deterministic finite automata. These languages are generated by regular expressions, which represent a set of strings. Regular languages have app
Important Mcq's
Midterm & Finalterm Prepration
Past papers included
Download PDF
- Which of the following is a regular language?
a) {anbn | n ? 0}
b) {anbn | n > 0}
c) {anbm | n ? m}
d) {an | n is prime}
Answer: a) {anbn | n ? 0}
Which of the following operations does not result in a regular language?
a) Union
b) Concatenation
c) Kleene star
d) Intersection
Answer: d) Intersection
Which of the following is a regular expression for the language consisting of all strings of 0's and 1's that do not contain the substring 11?
a) (0+1)11(0+1)
b) (0+1)0(0+10)
c) (0+1)(1+01)
d) (0+1)1(0+01)
Answer: d) (0+1)1(0+01)
Which of the following is not a regular language?
a) {0n1n | n ? 0}
b) {0n1n | n > 0}
c) {0n1m | n, m ? 0}
d) {0n | n is a perfect square}
Answer: d) {0n | n is a perfect square}
Which of the following is a regular expression for the language consisting of all strings of 0's and 1's that end with 01?
a) (0+1)*01
b) (0+1)*0(1+01)
c) (0+1)*1(0+1)*01
d) (0+1)1(1+01)
Answer: c) (0+1)*1(0+1)*01
Which of the following is a regular expression for the language consisting of all strings of 0's and 1's that contain at least one 0 and one 1?
a) (0+1)01(0+1)
b) (0+1)*0(0+1)1(0+1)
c) (0+1)*0+(0+1)1+
d) (0+1)
Answer: b) (0+1)*0(0+1)1(0+1)
Which of the following is a regular language?
a) {w | w contains an equal number of 0's and 1's}
b) {w | the length of w is a prime number}
c) {w | w contains a substring of three 0's}
d) {w | the number of 0's in w is equal to the number of 1's in w}
Answer: d) {w | the number of 0's in w is equal to the number of 1's in w}
Which of the following is a regular expression for the language consisting of all strings of 0's and 1's with an even number of 0's and an odd number of 1's?
a) (0+1)*00(0+1)11(0+1)
b) (0+1)*01(0+1)10(0+1)
c) (0+1)*0(0+1)*1(0+1)*1
d) (0+1)*0(0+1)*1+
Answer: c) (0+1)*0(0+1)*1(0+1)*1
Which of the following is not a regular language
Subjective Short Notes
Midterm & Finalterm Prepration
Past papers included
Download PDF
Define regular languages and provide examples. Answer: Regular languages are a class of formal languages that can be recognized by a deterministic or non-deterministic finite automaton. Examples of regular languages include binary strings with an even number of 0's, strings of a's and b's where every a is followed by a b, and strings of a's and b's that contain at least one a and at least one b. Explain the Pumping Lemma for regular languages. Answer: The Pumping Lemma for regular languages states that for any regular language L, there exists a constant n such that any string in L of length greater than or equal to n can be divided into three parts: u, v, and w, such that uvw is in L, |v| > 0, and for all i >= 0, uv^iw is also in L. What is the difference between a regular language and a context-free language? Answer: The main difference between a regular language and a context-free language is the type of grammar used to generate the language. Regular languages are generated by regular grammars, while context-free languages are generated by context-free grammars. Provide an example of a regular expression for a language that accepts all strings of 0's and 1's that contain the substring "101". Answer: The regular expression for this language is (0+1)101(0+1). Can a regular language have an infinite number of strings? Explain your answer. Answer: Yes, a regular language can have an infinite number of strings. For example, the language of all strings of 0's and 1's is a regular language and has an infinite number of strings. Explain the concept of closure properties in the context of regular languages. Answer: Closure properties refer to the ability of regular languages to be combined and transformed in various ways to create new regular languages. Closure properties include union, concatenation, and Kleene star. What is the difference between a deterministic finite automaton (DFA) and a non-deterministic finite automaton (NFA)? Answer: The main difference between a DFA and an NFA is in their transition functions. In a DFA, each transition is uniquely determined by the current state and the input symbol, while in an NFA, there may be multiple possible transitions for a given input symbol and state. Define a regular grammar and provide an example. Answer: A regular grammar is a type of grammar that generates a regular language. It consists of a set of productions, where each production is of the form A -> aB or A -> a, where A and B are non-terminals and a is a terminal symbol. An example of a regular grammar is S -> 0S | 1S | ?, which generates the language of all strings of 0's and 1's. What is the difference between a regular expression and a regular grammar? Answer: The main difference between a regular expression and a regular grammar is the way they describe regular languages. A regular expression is a pattern that describes a set of strings, while a regular grammar is a set of production rules that generate the same set of strings. Can every regular language be recognized by a deterministic finite automaton? Explain your answer. Answer: Yes, every regular language can be recognized by a deterministic finite automaton, as a DFA is equivalent in power to a regular expression and can recognize any regular language.